Limits of Vertex Replacement Rules
نویسندگان
چکیده
منابع مشابه
The Growth of Limits of Vertex Replacement Rules
In this paper, we give necessary and sufficient conditions that determine when a vertex replacement rule given by exactly one replacement graph generates an infinite graph with exponential growth and when it generates an infinite graph with polynomial growth. We also compute the formula for the growth degree of infinite graphs with polynomial growth that are generated by vertex replacement rule...
متن کاملLimits of vertex-transitive graphs
The class of all connected vertex-transitive graphs with finite valency forms a metric space under a natural combinatorially defined metric. We prove some basic properties of this metric space and discuss the structure of graphs which are limit points of the subset consisting of all finite graphs that admit a vertex-primitive group of automorphisms. A description of these limit graphs would pro...
متن کاملVertex in QCD Sum Rules
The J/ψDD form factor is evaluated in a QCD sum rule calculation for both D and J/ψ off-shell mesons. We study the double Borel sum rule for the three point function of two pseudoscalar and one vector meson current. We find that the momentum dependence of the form factors is different if the D or the J/ψ meson is off-shell, but they lead to the same coupling constant in the J/ψDD vertex. The co...
متن کاملThe Limits of Tractability: MIN-VERTEX-COVER
Today, we are talking about the MIN-VERTEX-COVER problem. MIN-VERTEX-COVER is a classic NP-hard optimization problem, and to solve it, we need to compromise. We look at three approaches. First, we consider restricting our attention to a special case: a (binary) tree. Then, we look at an exponential algorithm parameterized by the size of the vertex cover. Finally, we look at approximation algori...
متن کاملVertex Deletion games with Parity rules
We consider a group of related combinatorial games all of which are played on an undirected graph. A move is to remove a vertex but which vertices are available depend on parity conditions. In the main game Left removes a vertex of even degree and Right removes a vertex of odd degree. This game is special case of Odd-Even games introduced, for the first time, in this paper. The obvious two vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2007
ISSN: 0035-7596
DOI: 10.1216/rmjm/1182536174